The Model of Most Informative Patterns and Its Application to Knowledge Extraction from Graph Databases
Identifieur interne : 003885 ( Main/Exploration ); précédent : 003884; suivant : 003886The Model of Most Informative Patterns and Its Application to Knowledge Extraction from Graph Databases
Auteurs : Frédéric Pennerath [France] ; Amedeo Napoli [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: This article introduces the class of Most Informative Patterns (MIPs) for characterizing a given dataset. MIPs form a reduced subset of non redundant closed patterns that are extracted from data thanks to a scoring function depending on domain knowledge. Accordingly, MIPs are designed for providing experts good insights on the content of datasets during data analysis. The article presents the model of MIPs and their formal properties wrt other kinds of patterns. Then, two algorithms for extracting MIPs are detailed: the first directly searches for MIPs in a dataset while the second screens MIPs from frequent patterns. The efficiencies of both algorithms are compared when applied to reference datasets. Finally the application of MIPs to labelled graphs, here molecular graphs, is discussed.
Url:
- https://api.istex.fr/ark:/67375/HCB-XPPF2QNJ-X/fulltext.pdf
- https://hal-supelec.archives-ouvertes.fr/hal-00437536
DOI: 10.1007/978-3-642-04174-7_14
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003216
- to stream Istex, to step Curation: 003176
- to stream Istex, to step Checkpoint: 000992
- to stream Hal, to step Corpus: 004B57
- to stream Hal, to step Curation: 004B57
- to stream Hal, to step Checkpoint: 002A58
- to stream Main, to step Merge: 003963
- to stream Main, to step Curation: 003885
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The Model of Most Informative Patterns and Its Application to Knowledge Extraction from Graph Databases</title><author><name sortKey="Pennerath, Frederic" sort="Pennerath, Frederic" uniqKey="Pennerath F" first="Frédéric" last="Pennerath">Frédéric Pennerath</name></author><author><name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:D2B3E5D43F3FF9B024486EF6D4837D1FC4105A9B</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-04174-7_14</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-XPPF2QNJ-X/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003216</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003216</idno><idno type="wicri:Area/Istex/Curation">003176</idno><idno type="wicri:Area/Istex/Checkpoint">000992</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000992</idno><idno type="wicri:doubleKey">0302-9743:2009:Pennerath F:the:model:of</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-00437536</idno><idno type="url">https://hal-supelec.archives-ouvertes.fr/hal-00437536</idno><idno type="wicri:Area/Hal/Corpus">004B57</idno><idno type="wicri:Area/Hal/Curation">004B57</idno><idno type="wicri:Area/Hal/Checkpoint">002A58</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">002A58</idno><idno type="wicri:Area/Main/Merge">003963</idno><idno type="wicri:Area/Main/Curation">003885</idno><idno type="wicri:Area/Main/Exploration">003885</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The Model of Most Informative Patterns and Its Application to Knowledge Extraction from Graph Databases</title><author><name sortKey="Pennerath, Frederic" sort="Pennerath, Frederic" uniqKey="Pennerath F" first="Frédéric" last="Pennerath">Frédéric Pennerath</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>Supélec, Campus de Metz, 2 rue Édouard Belin, 57070, Metz</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Metz</settlement></placeName></affiliation><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>Orpailleur team, LORIA, BP 239, 54506, Vandoeuvre-lès-Nancy Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>Orpailleur team, LORIA, BP 239, 54506, Vandoeuvre-lès-Nancy Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This article introduces the class of Most Informative Patterns (MIPs) for characterizing a given dataset. MIPs form a reduced subset of non redundant closed patterns that are extracted from data thanks to a scoring function depending on domain knowledge. Accordingly, MIPs are designed for providing experts good insights on the content of datasets during data analysis. The article presents the model of MIPs and their formal properties wrt other kinds of patterns. Then, two algorithms for extracting MIPs are detailed: the first directly searches for MIPs in a dataset while the second screens MIPs from frequent patterns. The efficiencies of both algorithms are compared when applied to reference datasets. Finally the application of MIPs to labelled graphs, here molecular graphs, is discussed.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Metz</li><li>Vandœuvre-lès-Nancy</li></settlement></list><tree><country name="France"><region name="Grand Est"><name sortKey="Pennerath, Frederic" sort="Pennerath, Frederic" uniqKey="Pennerath F" first="Frédéric" last="Pennerath">Frédéric Pennerath</name></region><name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name><name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name><name sortKey="Pennerath, Frederic" sort="Pennerath, Frederic" uniqKey="Pennerath F" first="Frédéric" last="Pennerath">Frédéric Pennerath</name><name sortKey="Pennerath, Frederic" sort="Pennerath, Frederic" uniqKey="Pennerath F" first="Frédéric" last="Pennerath">Frédéric Pennerath</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003885 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003885 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:D2B3E5D43F3FF9B024486EF6D4837D1FC4105A9B
|texte= The Model of Most Informative Patterns and Its Application to Knowledge Extraction from Graph Databases
}}
| This area was generated with Dilib version V0.6.33. |  |